NOTE Enumeration of All Simple t (t+7,t+1,2) Designs
نویسنده
چکیده
We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 t 5, i.e. for all possible t , and this enumeration is new for t 3. The number of nonisomorphic designs is equal to 3, 13, 27, 1 and 1 for t = 1, 2, 3, 4 and 5, respectively. We also present some properties of these designs including orders of their full automorphism groups and resolvability.
منابع مشابه
Enumeration of t-Designs Through Intersection Matrices
In this paper, we exploit some intersection matrices to empower a backtracking approach based on Kramer–Mesner matrices. As an application, we consider the interesting family of simple t-ðtþ 8; tþ 2; 4Þ designs, 1 t 4, and provide a complete classification for t 1⁄4 1; 4, as well as a classification of all non-rigid designs for t 1⁄4 2; 3. We also enumerate all rigid designs for t 1⁄4 2. The co...
متن کاملSome Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we show that all of these designs are indecomposable and therefore they do not lead to large sets of 5(14,6,3) designs. Moreover, they provide the first counterexamples for a conjecture on disjoint t-designs which states...
متن کاملEnumeration of 2-(12, 3, 2) designs
A backtrack search with isomorph rejection is carried out to enumerate the 2-(12,3,2) designs. There are 242 995 846 such designs, which have automorphism groups whose size range from 1 to 1536. There are 88 616 310 simple designs. The number of resolvable designs is 62 929; these have 74 700 nonisomorphic resolutions. We use the following standard notations. A t-(v, k, >.) design is a family o...
متن کاملA Note on the Existence of Non-simple Designs over Finite Fields
Designs over finite fields arise by replacing finite sets by vector spaces and orders of sets by dimensions of vector spaces. More formally, a t− (v, k, λ; q) design is a collection of k-subspaces over Fq , called blocks, such that each t-subspace is contained in exactly λ blocks. Such a design over a finite field is called simple, if no repeated blocks occur in the collection. Otherwise, the d...
متن کاملEnumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کامل